(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)
Rewrite Strategy: FULL
(1) DecreasingLoopProof (EQUIVALENT transformation)
The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
mark(f(X)) →+ a__f(mark(X))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X / f(X)].
The result substitution is [ ].
(2) BOUNDS(n^1, INF)
(3) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)
S is empty.
Rewrite Strategy: FULL
(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(6) Obligation:
TRS:
Rules:
a__f(X) → g(h(f(X)))
mark(f(X)) → a__f(mark(X))
mark(g(X)) → g(X)
mark(h(X)) → h(mark(X))
a__f(X) → f(X)
Types:
a__f :: f:h:g → f:h:g
g :: f:h:g → f:h:g
h :: f:h:g → f:h:g
f :: f:h:g → f:h:g
mark :: f:h:g → f:h:g
hole_f:h:g1_0 :: f:h:g
gen_f:h:g2_0 :: Nat → f:h:g
(7) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
mark
(8) Obligation:
TRS:
Rules:
a__f(
X) →
g(
h(
f(
X)))
mark(
f(
X)) →
a__f(
mark(
X))
mark(
g(
X)) →
g(
X)
mark(
h(
X)) →
h(
mark(
X))
a__f(
X) →
f(
X)
Types:
a__f :: f:h:g → f:h:g
g :: f:h:g → f:h:g
h :: f:h:g → f:h:g
f :: f:h:g → f:h:g
mark :: f:h:g → f:h:g
hole_f:h:g1_0 :: f:h:g
gen_f:h:g2_0 :: Nat → f:h:g
Generator Equations:
gen_f:h:g2_0(0) ⇔ hole_f:h:g1_0
gen_f:h:g2_0(+(x, 1)) ⇔ h(gen_f:h:g2_0(x))
The following defined symbols remain to be analysed:
mark
(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol mark.
(10) Obligation:
TRS:
Rules:
a__f(
X) →
g(
h(
f(
X)))
mark(
f(
X)) →
a__f(
mark(
X))
mark(
g(
X)) →
g(
X)
mark(
h(
X)) →
h(
mark(
X))
a__f(
X) →
f(
X)
Types:
a__f :: f:h:g → f:h:g
g :: f:h:g → f:h:g
h :: f:h:g → f:h:g
f :: f:h:g → f:h:g
mark :: f:h:g → f:h:g
hole_f:h:g1_0 :: f:h:g
gen_f:h:g2_0 :: Nat → f:h:g
Generator Equations:
gen_f:h:g2_0(0) ⇔ hole_f:h:g1_0
gen_f:h:g2_0(+(x, 1)) ⇔ h(gen_f:h:g2_0(x))
No more defined symbols left to analyse.